A new correctness criterion for multiplicative non-commutative proof nets
نویسنده
چکیده
We introduce a new correctness criterion for multiplicative non commutative proof nets which can be considered as the non-commutative counterpart to the Danos-Regnier criterion for proof nets of linear logic. The main intuition relies on the fact that any switching for a proof net (obtained by mutilating one premise of each disjunction link) can be naturally viewed as a series-parallel order variety (a cyclic relation) on the conclusions of the proof net.
منابع مشابه
Proof Nets for Multiplicative Cyclic Linear Logic and Lambek Calculus
This paper presents a simple and intuitive syntax for proof nets of the multiplicative cyclic fragment (McyLL) of linear logic (LL). The proposed correctness criterion for McyLL proof nets can be considered as the non-commutative counterpart of the famous Danos contraction criterion for proof nets of the pure multiplicative fragment (MLL) of LL. Unlike the most part of current syntaxes for non-...
متن کاملNATURAL DEDUCTION AND COHERENCE FOR NON - SYMMETRIC LINEARLY DISTRIBUTIVE CATEGORIES Dedicated to Joachim Lambek
In this paper certain proof-theoretic techniques of [BCST] are applied to non-symmetric linearly distributive categories, corresponding to non-commutative negation-free multiplicative linear logic (mLL). First, the correctness criterion for the two-sided proof nets developed in [BCST] is adjusted to work in the non-commutative setting. Second, these proof nets are used to represent morphisms in...
متن کاملCyclic Multiplicative-Additive Proof Nets of Linear Logic with an Application to Language Parsing
This paper concerns a logical approach to natural language parsing based on proof nets (PNs), i.e. de-sequentialized proofs, of linear logic (LL). It first provides a syntax for proof structures (PSs) of the cyclic multiplicative and additive fragment of linear logic (CyMALL). A PS is an oriented graph, weighted by boolean monomial weights, whose conclusions Γ are endowed with a cyclic order σ....
متن کاملCommutative Locative Quantifiers for Multiplicative Linear Logic
The paper presents a solution to the technical problem posed by Girard after the introduction of Ludics of how to define proof nets with quantifiers that commute with multiplicatives. According to the principles of Ludics, the commuting quantifiers have a “locative” nature, in particular, quantified formulas are not defined modulo variable renaming. The solution is given by defining a new corre...
متن کاملYet Another Correctness Criterion for Multiplicative Linear Logic with MIX
A new correctness criterion for discriminating Proof Nets among Proof Structures of Multiplicative Linear Logic with MIX rule is provided. This criterion is inspired by an original interpretation of Proof Structures as distributed systems, and logical formulae as processes. The computation inside a system corresponds to the logical ow of information inside a proof, that is, roughly, a distribut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Arch. Math. Log.
دوره 42 شماره
صفحات -
تاریخ انتشار 2003